-
1 устойчивость алгоритма
Русско-английский словарь по электронике > устойчивость алгоритма
-
2 устойчивость алгоритма
Русско-английский словарь по радиоэлектронике > устойчивость алгоритма
-
3 устойчивость алгоритма
algorithm stability мат.Русско-английский научно-технический словарь Масловского > устойчивость алгоритма
-
4 устойчивость алгоритма
Mathematics: algorithm stabilityУниверсальный русско-английский словарь > устойчивость алгоритма
-
5 устойлівасць вылічальнага алгарытму
stability of computing algorithmБеларуска-ангельскі слоўнік матэматычных тэрмінаў і тэрміналагічных словазлучэнняў > устойлівасць вылічальнага алгарытму
-
6 algoritmo de envío
(n.) = routing algorithmEx. Along with the sheer mass of the data necessary to route packets to a large number of networks, there are many problems with the updating, stability, and optimality of the routing algorithms.* * *(n.) = routing algorithmEx: Along with the sheer mass of the data necessary to route packets to a large number of networks, there are many problems with the updating, stability, and optimality of the routing algorithms.
-
7 стабильность алгоритма
Makarov: stability of algorithmУниверсальный русско-английский словарь > стабильность алгоритма
-
8 этот алгоритм обладает исключительной устойчивостью
Mathematics: this algorithm features extraordinary stabilityУниверсальный русско-английский словарь > этот алгоритм обладает исключительной устойчивостью
-
9 Обусловлен плохо (хорошо)
In other words, if $lambda$ is near (far from) another eigenvalue of $A$, then its eigenvector will be ill (possibly well) conditionedIt should not be thought that the only ill-conditioned eigenvectors are those corresponding to poorly separated eigenvaluesSome insight into the meaning of the definition of stability can be gained by considering what happens when a stable algorithm is used to solve a well-conditioned problemРусско-английский словарь по прикладной математике и механике > Обусловлен плохо (хорошо)
-
10 Обусловлен плохо (хорошо)
In other words, if $lambda$ is near (far from) another eigenvalue of $A$, then its eigenvector will be ill (possibly well) conditionedIt should not be thought that the only ill-conditioned eigenvectors are those corresponding to poorly separated eigenvaluesSome insight into the meaning of the definition of stability can be gained by considering what happens when a stable algorithm is used to solve a well-conditioned problemРусско-английский словарь по прикладной математике и механике > Обусловлен плохо (хорошо)
-
11 не всегда
Этот алгоритм не всегда обеспечивает устойчивость процесса - This algorithm does not always provide the stability of the processРусско-английский словарь по прикладной механике > не всегда
-
12 детерминированный
прил. deterministic, determinateРусско-английский большой базовый словарь > детерминированный
-
13 оптимальный
1. optimum2. optimal[lang name="Russian"]оптимальное решение; оптимальный план — optimal solution
3. optimally
См. также в других словарях:
Stability — can refer to: *Aircraft flight Stability (aircraft) *In atmospheric fluid dynamics, atmospheric stability, a measure of the turbulence in the ambient atmosphere *BIBO stability (Bounded Input, Bounded Output stability), in signal processing and… … Wikipedia
Numerical stability — In the mathematical subfield of numerical analysis, numerical stability is a desirable property of numerical algorithms. The precise definition of stability depends on the context, but it is related to the accuracy of the algorithm. A related… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… … Wikipedia
Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
Routh-Hurwitz stability criterion — The Routh Hurwitz stability criterion is a necessary (and frequently sufficient) method to establish the stability of a single input, single output (SISO), linear time invariant (LTI) control system. More generally, given a polynomial, some… … Wikipedia
Electronic stability control — (ESC) is a computerized technology [1][2] that may potentially improve the safety of a vehicle s stability by detecting and minimizing skids.[3] When ESC detects loss of steering control, it automatically applies the brakes to help steer the… … Wikipedia
Integer relation algorithm — An integer relation between a set of real numbers x 1, x 2, ..., x n is a set of integers a 1, a 2, ..., a n, not all 0, such that:a 1x 1 + a 2x 2 + cdots + a nx n = 0.,An integer relation algorithm is an algorithm for finding integer relations.… … Wikipedia
Strassen algorithm — In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. It is asymptotically faster than the standard matrix multiplication algorithm, but slower than… … Wikipedia
De Boor's algorithm — In the mathematical subfield of numerical analysis the de Boor s algorithm is a fast and numerically stable algorithm for evaluating spline curves in B spline form. It is a generalization of the de Casteljau s algorithm for Bézier curves. The… … Wikipedia
